Optimally Distributing Interactions Between Composed Semantic Web Services

نویسندگان

  • Ion Constantinescu
  • Walter Binder
  • Boi Faltings
چکیده

When information services are organized to provide some composed functionality, their interactions can be formally represented as workflows. Traditionally, workflows are executed by centralized engines that invoke the necessary services and collect results. If services are clustered (e.g., based on geographic criteria), locally routing intermediary results between services in the same cluster can be more efficient. This paper has several contributions: First, it presents a framework allowing the execution of workflow parts to be mediated by special execution sites. Second, we describe a trigger-based mechanism allowing partial results to be routed between execution sites. Finally, we present an approach for optimally computing the distribution of workflow parts to execution sites accordingly to an integrated cost model for workflow execution. The model is created by merging cost-models provided by individual execution sites trough a Contract Net task brokering protocol. The models consider cost measures for service activation, parameter transfer, and service execution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Constraint and QoS-Aware Large-Scale Web Service Composition

Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...

متن کامل

Composition Constraints for Semantic Web Services

Current service description and composition approaches consider simplistic method invocation. They do not accommodate ongoing interactions between service providers and consumers, nor do they support descriptions of legal protocols of interactions among them. We propose richer representations which enable us to capture more of the semantics of services than current approaches. Further, we devel...

متن کامل

A procedure for Web Service Selection Using WS-Policy Semantic Matching

In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...

متن کامل

Semantic Discovery Optimization: Matching Composed Semantic Web Services at Publishing Time

This paper describes an algorithm optimizing the discovery process for composed semantic web services. The algorithm can be used to improve discovery of appropriate component services at invocation time. It performs semantic matchmaking of goals of a composed service to appropriate component services at publishing time. The semantic discovery problem at invocation time is therefore reduced to a...

متن کامل

Verifying Security of Composed Interaction for Web Services

SOAP-based complex interactions of multiple end points in Web Services mostly consist of sub-processes or sub-protocols, which are reused as modular and need to comply with corresponding standards and proposals. However, the consistency of local and global properties of interactions is important for practical applications with high security requirement. Therefore, a method is proposed to formal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005